Once again on the equivalence theorem
نویسنده
چکیده
We present the proof of the equivalence theorem in quantum field theory which is based on a formulation of this problem in the field-anitfield formalism. As an example, we consider a model in which a different choices of natural finite counterterms is possible, leading to physically non-equivalent quantum theories while the equivalent theorem remains valid.
منابع مشابه
EQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملTannaka Duality for Geometric Stacks
Let X and S denote algebraic stacks of finite type over the field C of complex numbers, and let X and S denote their analytifications (which are stacks in the complex analytic setting). Analytification gives a functor φ : HomC(S,X) → Hom(S , X). It is natural to ask for circumstances under which φ is an equivalence. In the case where X and S are projective schemes, a satisfactory answer was obt...
متن کاملDistributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کاملRepresenting Herbrand Models by Grammars and Deciding Equivalence Eeciently
Finding computationally valuable representations of models of predicate logic formulas is an important subtask in many elds related to automated theorem proving, e.g. automated model building or semantic resolution. In this article we investigate the use of context-free languages for representing single Herbrand models, emphasizing algorith-mic issues like the equivalence test (which we solve b...
متن کامل